Enumeration of generalized lattice paths by string types, peaks, and ascents

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elliptic enumeration of nonintersecting lattice paths

We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. The elliptic generating function of paths from a given starting point to a given end point evaluates to an elliptic generalization of the binomial coefficient. Convolution gives an identity equivalent to Frenkel and Tu...

متن کامل

Dyck paths with coloured ascents

We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon, etc. In some cases enumeration gives new expression for sequences enumerating these structures.

متن کامل

The Enumeration of Lattice Paths 3

We survey old and new results on the enumeration of lattice paths in the plane with a given number of turns, including the recent developments on the enumeration of nonintersecting lattice paths with a given number of turns. Motivations to consider such enumeration problems come from various elds, e.g. probability, statistics, combinatorics, and commutative algebra. We show that the appropriate...

متن کامل

Counting Humps and Peaks in Generalized Dyck Paths

Let us call a lattice path in Z × Z from (0, 0) to (n, 0) using U = (1, k), D = (1,−1), and H = (a, 0) steps and never going below the x-axis a (k, a)-path (of order n). A super (k, a)-path is a (k, a)-path which is permitted to go below the x-axis. We relate the total number of humps in all of the (k, a)paths of order n to the number of super (k, a)-paths, where a hump is defined to be a seque...

متن کامل

Lattice paths and generalized cluster complexes

In this talk we will introduce/survey the cluster complexes of Fomin and Zelevinsky, generalized cluster complexes of Fomin and Reading, and their associated M, F, H triangles by Chapoton, Armstrong and Krattenthaler respectively. After that we propose a variant of the generalized Schröder paths and generalized Delannoy paths by giving a restriction on the positions of certain steps. This pure ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2016

ISSN: 0012-365X

DOI: 10.1016/j.disc.2016.04.024